Efficient Path Planning Method of USV for Intelligent Target Search
نویسندگان
چکیده
منابع مشابه
UAV INTELLIGENT PATH PLANNING FOR WILDERNESS SEARCH AND RESCUE by
UAV INTELLIGENT PATH PLANNING FOR WILDERNESS SEARCH AND RESCUE Rongbin Lanny Lin Department of Computer Science Master of Science In Wilderness Search and Rescue (WiSAR), the incident commander (IC) creates a probability distribution map of the likely location of the missing person. This map is important because it guides the IC in allocating search resources and coordinating efforts, but it of...
متن کاملFormation Control and Path Planning of Two Robots for Tracking a Moving Target
This paper addresses the dynamic path planning for two mobile robots in unknownenvironment with obstacle avoidance and moving target tracking. These robots must form atriangle with moving target. The algorithm is composed of two parts. The first part of thealgorithm used for formation planning of the robots and a moving target. It generates thedesired position for the robots for the next step. ...
متن کاملStudy of Evolutionary and Swarm Intelligent Techniques for Soccer Robot Path Planning
Finding an optimal path for a robot in a soccer field involves different parameters such as the positions of the robot, positions of the obstacles, etc. Due to simplicity and smoothness of Ferguson Spline, it has been employed for path planning between arbitrary points on the field in many research teams. In order to optimize the parameters of Ferguson Spline some evolutionary or intelligent al...
متن کاملEfficient Cooperative Path-Planning
Even after lots of effort made by today game companies, recent state of the art real-time strategy (RTS) games (e.g. Age of Empires, Warcraft III) lack an efficient robust path planner for mass multi-agent path planning. The main reason for this failure is that current methods do not try to solve the whole path planning problem as one task. One recent work that addresses this issue is Cooperati...
متن کاملEfficient Incremental Search for Moving Target Search
Incremental search algorithms reuse information from previous searches to speed up the current search and are thus often able to find shortest paths for series of similar search problems faster than by solving each search problem independently from scratch. However, they do poorly on moving target search problems, where both the start and goal cells change over time. In this paper, we thus deve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Geovisualization and Spatial Analysis
سال: 2019
ISSN: 2509-8810,2509-8829
DOI: 10.1007/s41651-019-0035-0